NetNews Offline 2/NetNews Offline Volume 2.iso/news/comp/lang/c++-part2/18268

Internet Message Format | 1996-08-05 | 998 b

Path: lerc.nasa.gov!purdue!yuma!yuma!not-for-mail
From: [e-mail] ( stephen schroeder)
Newsgroups: comp.lang.c++
Subject: Re: Survey: recursive
Date: 19 Apr 1996 12:41:29 -0600
Organization: Computer Science Department, Colorado State University
Distribution: world
Message-ID: <4l8mop$[e-mail]>
References: <4l6s7e$[e-mail]>
NNTP-Posting-Host: schubert.cs.colostate.edu


In article <4l6s7e$[e-mail]>, Scott <[e-mail]> writes:
|> I am trying to get a feel of how long it would take an
|> average programmer to accomplish the following.
|>
|> Write a recursive function that determines the lowest
|> common denominator between two rational numbers for the
|> first time.  You may assume that you have a class rational
|> that does not include this method.  You have material
|> describing class rational, but no other reference material.
|>
|> The clock starts now.
|> Thanks
|>
|>

    cout<<1<<endl;